To split or not to split: Selecting the right server with batch arrivals
نویسندگان
چکیده
We consider a dispatching system, where jobs, arriving in batches, are assigned to single-server FCFS queues. Batches can be split to different queues on per job basis. However, the holding costs are batch-specific and incurred until the last member of the batch completes the service. By using the first policy improvement step of the MDP framework, we are able to derive robust dispatching policies, which split arriving batches only when deemed advantageous. The approach is also demonstrated in numerical examples.
منابع مشابه
An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملREES SHORT EXACT SEQUENCES OF S-POSETS
In this paper the notion of Rees short exact sequence for S-posets is introduced, and we investigate the conditions for which these sequences are left or right split. Unlike the case for S-acts, being right split does not imply left split. Furthermore, we present equivalent conditions of a right S-poset P for the functor Hom(P;-) to be exact.
متن کاملStrong convergence theorem for solving split equality fixed point problem which does not involve the prior knowledge of operator norms
Our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real Hilbert space. So many have used algorithms involving the operator norm for solving split equality fixed point problem, ...
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کاملTrunk Reservation Effects on Multi-Server System with Batch Arrivals of Loss and Delay Customers
A multi-server system with trunk reservation is studied. The system is offered by two types of customers (class-1 and class-2). They arrive in independent batch Poisson streams and have an exponentially distributed service time. Class-1 customers will be lost or rejected if they find all S servers busy on their arrivals. Class-2 customers will use at most S′ = S − R servers and enter a queue wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 41 شماره
صفحات -
تاریخ انتشار 2013